//
// Created by xili on 2024/8/31 10:06.
// GO BIG OR GO HOME.
//
#include "leetcode.h"

class Solution {
public:
    bool canMakeSquare(vector <vector<char>> &grid) {
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 2; j++) {
                int sum = (grid[i][j] == 'B') + (grid[i + 1][j] == 'B') + (grid[i][j + 1] == 'B') +
                          (grid[i + 1][j + 1] == 'B');
                if (sum != 2) return true;
            }
        }
        return false;
    }
};